Counterexamples to three conjectures concerning perfect graphs
نویسنده
چکیده
We will present counterexamples to a conjecture of Hoàng, a conjecture of Hertz and de Werra and to a conjecture of Reed. All these three conjectures are related to perfect graphs.
منابع مشابه
Unmixed $r$-partite graphs
Unmixed bipartite graphs have been characterized by Ravindra and Villarreal independently. Our aim in this paper is to characterize unmixed $r$-partite graphs under a certain condition, which is a generalization of Villarreal's theorem on bipartite graphs. Also, we give some examples and counterexamples in relevance to this subject.
متن کاملBuilding counterexamples
A conjecture concerning perfect graphs asserts that if for a Berge graph G the following three conditions hold: 1. neither G, nor Ḡ has an even pair; 2. neither G, nor Ḡ has a stable cutset; 3. neither G, nor Ḡ has a star-cutset, then G or Ḡ is diamond-free. We show that this conjecture is not valid and that, in a way, every weaker version is false too. To this end, we construct a class of perf...
متن کاملGeneration and properties of snarks
For many of the unsolved problems concerning cycles and matchings in graphs it is known that it is su cient to prove them for snarks, the class of nontrivial 3-regular graphs which cannot be 3-edge coloured. In the rst part of this paper we present a new algorithm for generating all non-isomorphic snarks of a given order. Our implementation of the new algorithm is 14 times faster than previous ...
متن کاملA computational attack on the conjectures of Graffiti: New counterexamples and proofs
Graffiti is a computer program that checks for relationships among certain graph invariants. It uses a database of graphs and has generated well over 700 conjectures. Having obtained a readily available computer tape of all the nonisomorphic graphs with 10 or fewer vertices, we have tested approximately 200 of the Graffiti conjectures and have found counterexamples for over 40 of them. For each...
متن کاملCounterexamples to Conjectures on Graphs with the Greatest Edge–Szeged Index
Recently, it was conjectured by Gutman and Ashrafi that the complete graph Kn has the greatest edge-Szeged index among simple graphs with n vertices. This conjecture turned out to be false, but led Vukičević to conjecture the coefficient 1/15552 of n6 for the approximate value of the greatest edge-Szeged index. We provide counterexamples to this conjecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 117 شماره
صفحات -
تاریخ انتشار 1993